A Maximal Monoidal Closed Category of Distributive Algebraic Domains

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The symmetric monoidal closed category of cpo $M$-sets

In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.

متن کامل

Some Monoidal Closed Categories of Stable Domains and Event Structures

This paper introduces the following new constructions on stable domains and event structures: the tensor product, the linear function space, and the exponential. It results in a monoidal closed category of dI-domains as well as one of stable event structures which can be used to interpret intuitionistic linear logic. Finally, the usefulness of the category of stable event structures for modelin...

متن کامل

Monoidal Algebraic Model Structures

Extending previous work, we define monoidal algebraic model structures and give examples. The main structural component is what we call an algebraic Quillen two-variable adjunction; the principal technical work is to develop the category theory necessary to characterize them. Our investigations reveal an important role played by “cellularity”—loosely, the property of a cofibration being a relat...

متن کامل

The Largest Cartesian Closed Category of Stable Domains

Berry's category of dI-domains with stable functions is a relatively intricate , yet elegant framework for semantics of programming languages. Despite over fteen years of work in the area, the exact reasons for dis-tributivity (Axiom d) and nitariness (Axiom I) have not been fully ex-plicated. This paper shows that Axiom d and Axiom I are important when one works within the realm of Scott-domai...

متن کامل

The largest Cartesian closed category of domains, considered constructively

A conjecture of Smyth is discussed which says that if D and [D → D] are effectively algebraic directed-complete partial orders with least element (cpo’s), then D is an effectively strongly algebraic cpo, where it was not made precise what is meant by an effectively algebraic and an effectively strongly algebraic cpo. Notions of an effectively strongly algebraic cpo and an effective SFP domain a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1995

ISSN: 0890-5401

DOI: 10.1006/inco.1995.1002